Blind Adaptive Space-Time Processing for Cyclostationary Signals

نویسندگان

  • Jie Zhang
  • K. Max Wong
  • Timothy N. Davidson
چکیده

In this paper we present a blind adaptive space-time processing algorithm for separating signals which are spectrally and/or spatially overlapped. The algorithm exploits the cyclostationary nature of many communication signals, but does not require knowledge of the statistical properties of the desired signal. It merely requires knowledge of a (distinct) cycle frequency. It is shown that the performance of the algorithm converges at a rate O(1/N), where N is the number of received samples, to the performance of the optimal (trained) receiver with the given structure. Furthermore, we provide an (algebraic) analysis of the performance of a multiuser communication system which employs our receiver, and confirm this result in simulation examples. These examples demonstrate that our cyclic adaptive space-time processor is an attractive alternative to beamforming or filtering alone. ∗Corresponding author. Department of Electrical and Computer Engineering, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada, L8S 4K1. Telephone: +1-905-525-9140, Ext. 24098. Fax: +1-905-521-2922. Email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind separation of convolutive mixtures of cyclostationary sources using an extended natural gradient method

An on-line adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary source signals is proposed. The algorithm is derived by a p plying natural gradient iterative learning to the novel cost function which is delined according to the wide sense cyclostationarity of signals. The efficiency of the algorithm is supported by simulations, which show that...

متن کامل

Adaptive LMS-Type Filter for Cyclostationary Signals - Full Version

Adaptive filters are employed in many signal processing and communications systems. Commonly, the design and analysis of adaptive algorithms, such as the least mean-squares (LMS) algorithm, is based on the assumptions that the signals are wide-sense stationary (WSS). However, in many cases, including, for example, interference-limited wireless communications and power line communications, the c...

متن کامل

Fast Adaptive Blind Beamforming Technique for Cyclostationary Signals

Castedo et al. have present a blind beamforming criterion based on the property of cyclostationary signals. A stochastic gradient-based algorithm, which needs to choose the step size suitably, was derived to compute the optimum weight vector. In this paper a fast adaptive algorithm is proposed. We show that the recursive least square techniques can be applied to solve this problem successfully ...

متن کامل

Blind separation of convolutive mixtures of cyclostationary signals

An adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary signals is proposed. The algorithm is derived by applying natural gradient iterative learning to a novel cost function which is defined according to the wide sense cyclostationarity of signals and can be deemed as a new member of the family of natural gradient algorithms for convolutive m...

متن کامل

Blind source-separation using second-order cyclostationary statistics

This paper studies the blind source separation (BSS) problem with the assumption that the source signals are cyclostationary. Identifiability and separability criteria based on second-order cyclostationary statistics (SOCS) alone are derived. The identifiability condition is used to define an appropriate contrast function. An iterative algorithm (ATH2) is derived to minimize this contrast funct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006